About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period

We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case

The linear complexity of new q-ary generalized cyclotomic sequences of period p

In this paper, we study the linear complexity of new q-ary generalized cyclotomic sequences of length pn over the finite field of order q. We show that these sequences have the high linear complexity when n ≥ 2. These sequences are constructed by new generalized cyclotomic classed prepared by X. Zeng at el

Notes about the linear complexity of Ding-Helleseth generalized cyclotomic sequences of length

We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We derive the linear complexity and the minimal polynomial of above-mentioned sequences over the finite fields of orders p and q, where p and q are two odd distinct primes, and obtain series of sequences with high linear complexity

Notes about the linear complexity of Ding-Helleseth generalized cyclotomic sequences of length pq over the finite field of order p or q

We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length pq. We derive the linear complexity and the minimal polynomial of above-mentioned sequences over the finite fields of orders p and q, where p and q are two odd distinct primes, and obtain series of sequences with high linear complexity